Dynamic Domain Classification for Fractal Image Compression
نویسندگان
چکیده
منابع مشابه
Dynamic Domain Classification for Fractal Image Compression
Fractal image compression is attractive except for its high encoding time requirements. The image is encoded as a set of contractive affine transformations. The image is partitioned into non-overlapping range blocks, and a best matching domain block larger than the range block is identified. There are many attempts on improving the encoding time by reducing the size of search pool for range-dom...
متن کاملSample-oriented Domain Adaptation for Image Classification
Image processing is a method to perform some operations on an image, in order to get an enhanced image or to extract some useful information from it. The conventional image processing algorithms cannot perform well in scenarios where the training images (source domain) that are used to learn the model have a different distribution with test images (target domain). Also, many real world applicat...
متن کاملLean domain pools for fractal image compression
In fractal image compression an image is partitioned into ranges for each of which a similar subimage, called domain, is selected from a pool of subimages. A typical choice for the domain pool may consist of all square subimages of a particular size. However, only a fraction of this large pool is actually used in the fractal code. This subset can be characterized in two related ways: (1) It con...
متن کاملFast Image Domain Fractal Compression by DCT Domain Block Matching
Fractal image compression entails a computationally costly search for matching image blocks. It is proposed that a block be represented by its DCT coefficients, which may be made invariant to many of the usual block transforms. Due to the energy packing properties of the DCT, the efficiency of an existing multidimensional nearest neighbour search is improved.
متن کاملIFS Fractal Code for Image Retrieval on Compression Domain
Digital image databases represent huge amount of data, automatic indexing and content base retrieval are crucial factors. IFS ( Iterated function system ) fractal code can be used to retrieve image and the position parameter of IFS code is replaced with the relative distance and direction parameter. A new algorithm of IFS fractal code for image retrieval on compression domain is presented in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Science and Information Technology
سال: 2012
ISSN: 0975-4660
DOI: 10.5121/ijcsit.2012.4208